Locality in Network Optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality in Network Optimization

We develop the first results on the local sensitivity analysis for the solution of a broad class of equality-constrained convex network optimization problems when perturbations are made on the constraints. In the context of the minimum-cost network flow problem — a paradigm in the theory of optimization — these results suggest a notion of decay of correlation for constrained optimization proced...

متن کامل

Automatic Data Locality Optimization Through Self-optimization

Data locality optimization in parallel systems is a non-trivial task. This task is typically done by the programmer: based upon an exhaustive analysis of an application’s run-time behavior, data access and distribution is re-modeled manually. Once the system, application, or just the input data set changes this effort has to be repeated. Ideally, this task can be automated which requires introd...

متن کامل

Locality Optimization for Program Instances

The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...

متن کامل

Locality Optimization for Program Instances

The degree of locality of a program reeects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...

متن کامل

Regularity Considerations in Instance{based Locality Optimization

Instance{based locality optimization 6] is a semi{automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of considering several small program instances, optimizing the instances, and generalizing the structure of the solutions to the program under consideration. A program instance appears as a sequence of statement instances that a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Control of Network Systems

سال: 2019

ISSN: 2325-5870,2372-2533

DOI: 10.1109/tcns.2018.2843164